package com.likou;

public class q64 {

    //    借鉴q62
    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = grid[m - 1][n - 1];
        for (int i = 1; i < m; i++) {
            dp[i][0] = grid[m - i - 1][n - 1] + dp[i - 1][0];
        }
        for (int i = 1; i < n; i++) {
            dp[0][i] = grid[m - 1][n - i - 1] + dp[0][i - 1];
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[m - i - 1][n - j - 1];
            }
        }

        return dp[m - 1][n - 1];
    }

}
